Overloaded CDMA Systems with Displaced Binary Signatures

نویسندگان

  • Frederik Vanhaverbeke
  • Marc Moeneclaey
چکیده

We extend three types of overloaded CDMA systems, by displacing in time the binary signature sequences of these systems: (1) random spreading (PN), (2) multiple-OCDMA (MO), and (3) PN/OCDMA (PN/O). For each of these systems, we determine the time shifts that minimize the overall multiuser interference power. The achievable channel load with coded and uncoded data is evaluated for the conventional (without displacement) and improved (with displacement) systems, as well as for systems based on quasi-Welch-bound-equality (QWBE) sequences, by means of several types of turbo detectors. For each system, the best performing turbo detector is selected in order to compare the performance of these systems. It is found that the improved systems substantially outperform their original counterparts. With uncoded data, (improved) PN/O yields the highest acceptable channel load. For coded data, MO allows for the highest acceptable channel load over all considered systems, both for the conventional and the improved systems. In the latter case, channel loads of about 280% are achievable with a low degradation as compared to a single user system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniquely Decodable Codes and Decoder for Overloaded Synchronous Cdma Systems Field of Invention

A recursive method for constructing uniquely decodable codes for overloaded synchronous CDMA systems, Where large signature codes With groWing overloading factors are reconstructed from the small ones. A class of uniquely decod able signature matrices (or encoders) for overloaded synchro nous CDMA are also devised. A decoder for synchronous CDMA systems to extract the user data by a number of c...

متن کامل

New Bounds for Binary and Ternary Overloaded CDMA

In this paper, we study binary and ternary matrices that are used for CDMA applications that are injective on binary or ternary user vectors. In other words, in the absence of additive noise, the interference of overloaded CDMA can be removed completely. Some new algorithms are proposed for constructing such matrices. Also, using an information theoretic approach, we conjecture the extent to wh...

متن کامل

Separability and Gain Control for Overloaded CDMA

In overloaded CDMA systems the high correlation among users’ signatures determines an overall performace that can be quite poor even for the optimal ML receiver. The geometric properties of signatures affect users’ separability, a condition that is necessary for achieving asymptotic efficiency. In this paper we establish gaussian separability conditions and propose an algorithm for the design o...

متن کامل

Nonlinear Multiuser Receiver for Optimized Chaos-Based DS-CDMA Systems

Chaos based communications have drawn increasing attention over the past years. Chaotic signals are derived from non-linear dynamic systems. They are aperiodic, broadband and deterministic signals that appear random in the time domain. Because of these properties, chaotic signals have been proposed to generate spreading sequences for wide-band secure communication recently. Like conventional DS...

متن کامل

New Power Estimation Methods for Highly Overloaded Synchronous CDMA Systems

In CDMA systems, the received user powers vary due to moving distance of users. Thus, the CDMA receivers consist of two stages. The first stage is the power estimator and the second one is a Multi-User Detector (MUD). Conventional methods for estimating the user powers are suitable for underor fully-loaded cases (when the number of users is less than or equal to the spreading gain). These metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • EURASIP J. Wireless Comm. and Networking

دوره 2004  شماره 

صفحات  -

تاریخ انتشار 2004